Convolutional source encoding

[l] J. M. Wozencraft , “Sequential decoding for reliable communication,” SC. D. dissertation, Dep. Elec. Eng., M.I.T., Cambridge, June 1957. [2] A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically opt imum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269, Apr. 1967. [3] R. G. Gallager, Information Theory and Reliable Communicat ion. New York: W iley, 1968. [4] K. Zigangirov, “Some sequential decoding procedures,” Probl. Peredach. Inform., vol. 2, no. 4, pp. 13-15, 1966. [5] F. Jelinek, “A fast sequential decoding algorithm using a stack,” IBM J. Res. Develop., vol. 13, pp. 675-685, Nov. 1969. [6] J. L. Massey, M. K. Sain,. and J. M. Geist, “Certain infinite Markov chains and sequential decoding,” Discrete Math., vol. 3, pp. 163-175, Sept. 1972. [7] D. Haccoun, “Multiple-path stack algorithms for decoding convolutional codes,” Ph.D. dissertation, Dep. Elec. Eng., McGill Univ., Montreal, Canada, June 1974. [8] R. M. Fano, “A heuristic discussion of probabilistic decoding,” IEEE Trans. Inform. Theory, vol. IT-9, pp. 64-74, Apr. 1963. [9] J. E. Savage, “The computat ion problem with sequential decoding,” M.I.T. Lincoln Lab., Cambridge, Tech. Rep. 371, Feb. 1965. [lo] I. M. Jacobs and E. R. Berlekamp, “A lower bound to the distribution of computat ion for sequential decoding,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 167-174, Apr. 1967. [ll] D. D. Falconer, “A hybrid sequential and algebraic decoding scheme,” Ph.D. dissertation, Dep. Elec. Eng., M.I.T., Cambridge, Feb. 1967. [12] F. Jelinek, “An upper bound on moments of sequential decoding effort,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 140-149, Jan. i969. .